package com.wrial.kind.linkedList;
/*
 * @Author  Wrial
 * @Date Created in 23:24 2020/8/12
 * @Description 合并 k 个排序链表，返回合并后的排序链表。请分析和描述算法的复杂度。
 */

public class MergeKLists {

    public ListNode mergeKLists(ListNode[] lists) {
        if (lists.length == 0) return null;

        return null;


    }

    public class ListNode {
        int val;
        ListNode next;

        ListNode(int x) {
            val = x;
        }
    }
}
